Relevance based on the Semantic Web
نویسندگان
چکیده
The amount of data stored and shared as well as the active number of users is continuously increasing on the Web. When such a large number of people meet with such a large amount of information on the Web, finding the right information in such a quite large scale is definitely a difficult task. Remarkable progress has been made over the last decade with the help of search technologies applied on the Web that is able to collect, maintain and filter the information according to users' needs. Search relevance is a core topic in Web search and directly affects the search performance. Several proposals are made in this regard employing different techniques to represent, model and measure relevance of a particular search result to the users. We explore the challenge of search relevance in the context of semantic search. We firstly introduce a general framework for relevance as it is understood in the context of Web search which allows us to compare different notions of relevance that exist in literature. Specifically, the notion of semantic relevance can be distinguished from the other types of relevance in Information Retrieval (IR) in terms of employing an underlying semantic model. We propose the emerging Semantic Web data on the Web which is represented in an RDF graph structure as an important candidate to become such a semantic model in a search process. However, the semantic gap between the structured representation of this type of data and the textual content is a major challenge for its applicability to Web search. For this purpose, we propose a probabilistic generative model to be trained from existing datasets of the Semantic Web data in order to bridge this semantic gap. Based on this model, we introduce novel ranking models by extending long-studied IR-based models that have been widely applied to Web search. Specifically we present a semantic relevance model that can model and determine relevance based on the semantic data by exploiting existing datasets to improve retrieval performance. In fact using Semantic Web data as a relevance source is orthogonal to existing search paradigms and can be used in a variety of contexts. We also show how semantic relevance can be utilized to extend different types of IR-based models (i.e. generative or discriminative) to search different types of data (i.e. unstructured and structured). Termin: Mittwoch, 21. Dezember 2011, 15:45 Uhr Ort: Englerstraße 11, 76131 Karlsruhe Kollegiengebäude am Ehrenhof (Geb. 11.40), 2. OG, Raum 231 (Hinweise für Besucher: www.aifb.kit.edu/Allgemeines/Besucher) Veranstalter: Institut AIFB, Forschungsgruppe Wissensmanagement Zu diesem Vortrag lädt das Institut für Angewandte Informatik und Formale Beschreibungsverfahren alle Interessierten herzlich ein. Andreas Oberweis, Hartmut Schmeck, Detlef Seese, Wolffried Stucky, Rudi Studer (Org.), Stefan Tai
منابع مشابه
Query expansion based on relevance feedback and latent semantic analysis
Web search engines are one of the most popular tools on the Internet which are widely-used by expert and novice users. Constructing an adequate query which represents the best specification of users’ information need to the search engine is an important concern of web users. Query expansion is a way to reduce this concern and increase user satisfaction. In this paper, a new method of query expa...
متن کاملAn Executive Approach Based On the Production of Fuzzy Ontology Using the Semantic Web Rule Language Method (SWRL)
Today, the need to deal with ambiguous information in semantic web languages is increasing. Ontology is an important part of the W3C standards for the semantic web, used to define a conceptual standard vocabulary for the exchange of data between systems, the provision of reusable databases, and the facilitation of collaboration across multiple systems. However, classical ontology is not enough ...
متن کاملA procedure for Web Service Selection Using WS-Policy Semantic Matching
In general, Policy-based approaches play an important role in the management of web services, for instance, in the choice of semantic web service and quality of services (QoS) in particular. The present research work illustrates a procedure for the web service selection among functionality similar web services based on WS-Policy semantic matching. In this study, the procedure of WS-Policy publi...
متن کاملPresentation of an efficient automatic short answer grading model based on combination of pseudo relevance feedback and semantic relatedness measures
Automatic short answer grading (ASAG) is the automated process of assessing answers based on natural language using computation methods and machine learning algorithms. Development of large-scale smart education systems on one hand and the importance of assessment as a key factor in the learning process and its confronted challenges, on the other hand, have significantly increased the need for ...
متن کاملPresentation of an efficient automatic short answer grading model based on combination of pseudo relevance feedback and semantic relatedness measures
Automatic short answer grading (ASAG) is the automated process of assessing answers based on natural language using computation methods and machine learning algorithms. Development of large-scale smart education systems on one hand and the importance of assessment as a key factor in the learning process and its confronted challenges, on the other hand, have significantly increased the need for ...
متن کاملAHP Techniques for Trust Evaluation in Semantic Web
The increasing reliance on information gathered from the web and other internet technologies raise the issue of trust. Through the development of semantic Web, One major difficulty is that, by its very nature, the semantic web is a large, uncensored system to which anyone may contribute. This raises the question of how much credence to give each resource. Each user knows the trustworthiness of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011